翻訳と辞書
Words near each other
・ Count Your Blessings (hymn)
・ Count Your Blessings (Instead of Sheep)
・ Count Your Blessings (Richard Morgan & Edith Temple song)
・ Count Your Blessings, Woman
・ Count Your Change
・ Count Your Lucky Stars Records
・ Count Your Sheep
・ Count Yourself In
・ Count Zero
・ Count Zero (band)
・ Count's 77
・ Count's Feud
・ Count's House
・ Count-distinct problem
・ Count-kings
Countable chain condition
・ Countable Corp.
・ Countable set
・ Countably compact space
・ Countably generated
・ Countably generated module
・ Countably generated space
・ Countdown
・ Countdown (1968 film)
・ Countdown (2004 film)
・ Countdown (2011 film)
・ Countdown (2012 film)
・ Countdown (Australian TV series)
・ Countdown (Beyoncé song)
・ Countdown (comic strip)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Countable chain condition : ウィキペディア英語版
Countable chain condition

In order theory, a partially ordered set ''X'' is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in ''X'' is countable. There are really two conditions: the ''upwards'' and ''downwards'' countable chain conditions. These are not equivalent. The countable chain condition means the downwards countable chain condition, in other words no two elements have a common lower bound.
This is called the "countable chain condition" rather than the more logical term "countable antichain condition" for historical reasons related to certain chains of open sets in topological spaces and chains in complete Boolean algebras, where chain conditions sometimes happen to be equivalent to antichain conditions. For example, if κ is a cardinal, then in a complete Boolean algebra every antichain has size less than κ if and only if there is no descending κ-sequence of elements, so chain conditions are equivalent to antichain conditions.
Partial orders and spaces satisfying the ccc are used in the statement of Martin's axiom.
In the theory of forcing, ccc partial orders are used because forcing with any generic set over such an order preserves cardinals and cofinalities. Furthermore, the c.c.c. property is preserved by finite support iterations (see iterated forcing).
More generally, if κ is a cardinal then a poset is said to satisfy the κ-chain condition if every antichain has size less than κ. The countable chain condition is the ℵ1-chain condition.
==Examples and properties in topology==
A topological space is said to satisfy the countable chain condition, or Suslin's Condition, if the partially ordered set of non-empty open subsets of ''X'' satisfies the countable chain condition, i.e. every pairwise disjoint collection of non-empty open subsets of ''X'' is countable. The name originates from Suslin's Problem.
* Every separable topological space is ccc. Furthermore, the product space of at most c separable spaces is a separable space and, thus, ccc.
* Every metric space is ccc if and only if it's separable, but in general a ccc topological space need not be separable.
For example,
:\^ }
with the product topology is ccc but not separable.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Countable chain condition」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.